Eecient Parallel Computing on Workstation Clusters

نویسندگان

  • Thomas M. Warschko
  • Walter F. Tichy
  • Christian G. Herter
چکیده

We present novel hard-and software that eeciently implements communication primitives for parallel execution on workstation clusters. We provide low communication latencies, minimal protocol , zero operating system overhead, and high throughput. With this technology, it is possible to build eeective parallel systems using oo-the-shelf workstations. Our goal is to develop a standard interfaceboard and the necessary software for interfacing any number of computers, from a workstation to a cabinet full of workstation-boards.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Runtime Support for Replicated Parallel Simulators of an ATM Network on Workstation Clusters

An eeective approach of speeding up the simulation of an ATM network on workstation clusters is presented. In this approach, multiple simulation runs are performed by replicated parallel simulators (RPSs) concurrently. Since the execution platform of the simulation is in a shared-network environment, the RPSs must compete with other applications for resources. The RPSs support adaptive executio...

متن کامل

Parallel Woll Cluster Algorithms

The Woll single-cluster algorithm is the most eecient method known for Monte Carlo simulation of many spin models. Due to the irregular size, shape and position of the Woll clusters, this method does not easily lend itself to eecient parallel implementation, so that simulations using this method have thus far been connned to workstations and vector machines. Here we present two parallel impleme...

متن کامل

A Comparison Between Different Parallelization Methods on Workstation Clusters to Solve CFD-Problems

The eecient parallel solution of ow problems on parallel computers requires highly eecient numerical methods as well as highly eecient parallelization methods. Parallelization is mostly done using domain decomposition methods. With the introduction of the so-called combination method a big jump in computational speed is possible. Here, a numerical solution is computed on a so-called sparse grid...

متن کامل

Angewandte Mathematik Und Informatik Universit at Zu K Oln Dynamic Load Balancing for Simulations of Biological Aging Dynamic Load Balancing for Simulations of Biological Aging

The eecient usage of parallel computers and workstation clusters for biologically motivated simulations depends rst of all on a dynamic redistribution of the workload. For the development of a parallel algorithm for the Penna model of aging we have used a dynamic load balancing library , called PLB. It turns out that PLB manages a nearly balanced load situation during runtime taking only a low ...

متن کامل

Approaches to Support Parallel Programming on Workstation Clusters: A Survey

The goal of this report is to survey state of the art and existing approaches for parallel programming on workstation clusters with special emphasis on object{oriented programming. First, workstation clusters as parallel computing platforms are characterized and fundamental concepts for parallel programming are discussed. Then, an overview of existing tools, systems, languages, and environments...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995